Design of LDPC Codes Degree Sequences on Random Particle Swarm Optimization over Mixed Channel

نویسندگان

  • Kangning Sun
  • Linhua Ma
  • Yanhua Cao
  • Xing Hu
  • Shaocheng Huang
چکیده

—In optical, magnetic recording and FrequencyHopping communication with narrow band interference, white Gaussian noise and random erasures are existing all at once. We call this mixed channel. To analyze performance of low density parity-check (LDPC) codes over mixed channel, the stability condition for LDPC codes over it is proposed, from which we can draw a conclusion that a good degree sequence of LDPC codes over Gaussian channel is not optimized over mixed channel. It can also be supported by simulation. To search good degree sequences over mixed channel, the random particle swarm optimization and simulated annealing algorithm are combined to find some capacity-approaching degree sequences in different erasure probabilities. Some high-threshold degree sequences are showed. The threshold of signal-to-noise ratio can increase 1.6159dB than that of the classical degree sequences evaluated by Gaussian approximation over mixed channel.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low-Density Parity-Check Codes for the Gilbert-Elliott Channel

In this paper, we review recent developments concerning the application of lowdensity parity-check (LDPC) codes to the Gilbert-Elliott (GE) channel. Firstly, we discuss the analysis of LDPC estimation-decoding in these channels using density evolution. We show that the required conditions of density evolution are satisfied in the GE channel, and that analysis demonstrates that large potential g...

متن کامل

A Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems

Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...

متن کامل

Design of Irregular SC-LDPC Codes With Non-Uniform Degree Distributions by Linear Programing

In this paper, we propose a new design method of irregular spatially-coupled low-density paritycheck (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform degree distributions is difficult to design with low complexity because their density evolution equations are multi-dimensional. To solve the problem, the propos...

متن کامل

Successive maximization for the systematic design of universally capacity approaching rate-compatible sequences of LDPC code ensembles over binary-input output-symmetric memoryless channels

A systematic construction of capacity achieving lowdensity parity-check(LDPC) code ensemble sequences over the Binary Erasure Channel (BEC) has been proposed by Saeedi et al. based on a method, here referred to as Successive Maximization (SM). In SM, the fraction of degree-i nodes are successively maximized starting from i = 2 with the constraint that the ensemble remains convergent over the ch...

متن کامل

Scattered EXIT Charts for Finite Length LDPC Code Design

We introduce the Scattered Extrinsic Information Transfer (S-EXIT) chart as a tool for optimizing degree profiles of short length Low-Density Parity-Check (LDPC) codes under iterative decoding. As degree profile optimization is typically done in the asymptotic length regime, there is space for further improvement when considering the finite length behavior. We propose to consider the average ex...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCM

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2016